A Traffic Based Decomposition of Two-class Queueing Networks with Priority Service I
نویسندگان
چکیده
This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.
منابع مشابه
A traffic based decomposition of two-class queueing networks with priority service
Article history: Available online 5 March 2009
متن کامل/i Dewey Working Paper Alfred P. Sloan School of Management Some Badly Behaved Closed Queueing Networks Some Badly Behaved Closed Queueing Networks Received Some Badly Behaved Closed Queueing Networks
We study several variations of a multiclass closed queueinp network model, all closely related to the open priority network of Lu and Kumar. Foi each of our examples it is shown that, as the population size n —• oo, the long-run utilization rate of each server approaches a limit strictly less than one. Thus no "bottleneck station" emerges in the heavy traffic limit. This is analogous to the "ba...
متن کاملPriority queueing models for cognitive radio networks with traffic differentiation
In this paper, we present a new queueing model providing the accurate average system time for packets transmitted over a cognitive radio (CR) link for multiple traffic classes with the preemptive and non-preemptive priority service disciplines. The analysis considers general packet service time, general distributions for the channel availability periods and service interruption periods, and a s...
متن کاملTowards Better Multi-class Parametric-decomposition Approximations for Open Queueing Networks
Methods are developed for approximately characterizing the departure process of each customer class from a multi-class single-server queue with unlimited waiting space and the firstin first-out service discipline. The model is Σ(GI i / GI i )/1 with a non-Poisson renewal arrival process and a non-exponential service-time distribution for each class. The methods provide a basis for improving par...
متن کاملA New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009